Consistent Distributed Commit: A Constant Overhead Solution
نویسندگان
چکیده
منابع مشابه
Maintaining Database Consistency in Peer to Peer Networks
We present an algorithm for persistent consistent distributed commit (distributed database commit) in a dynamic, asynchronous, peer to peer network. The algorithm has constant overhead in time and space and almost constant communication complexity, allowing it to scale to very large size networks. Previous solutions required linear overhead in communication and space, making them unscalable. We...
متن کاملAsynchronous Checkpointing for PVM Requires Message-Logging
Distributed computing using networked workstations o ers cost-e cient parallel computing, but the higher rate of failure requires e ective fault-tolerance. Asynchronous consistent checkpointing o ers a low-overhead solution. Parallel Virtual Machine (PVM) allows a heterogeneous network of UNIX workstations to serve immmediately as a distributed computer by providing message-passing services imp...
متن کاملCheckpointing and Recovery for Distributed Shared Memory Applications
This paper proposes an approach for adding fault tolerance based on consistent checkpointing to dis tributed shared memory applications Two di erent mechanisms are presented to e ciently address the issue of message losses due to either site failures or unreliable non FIFO channels Both guarantee a correct and e cient recovery from a consistent distributed system state following a failure A var...
متن کاملEfficient Transparent Optimistic Rollback Recovery for Distributed Application Programs
Existing rollback-recovery methods using consistent checkpointing may cause high overhead for applications that frequently send output to the “outside world,” since a new consistent checkpoint must be written before the output can be committed, whereas existing methods using optimistic message logging may cause large delays in committing output, since processes may buffer received messages arbi...
متن کاملScalable Logging through Emerging Non-Volatile Memory
Emerging byte-addressable, non-volatile memory (NVM) is fundamentally changing the design principle of transaction logging. It potentially invalidates the need for flush-beforecommit as log records are persistent immediately upon write. Distributed logging—a once prohibitive technique for single node systems in the DRAM era—becomes a promising solution to easing the logging bottleneck because o...
متن کامل